Cell-Based First-Hit Ray Casting

نویسندگان

  • André Neubauer
  • Lukas Mroz
  • Helwig Hauser
  • Rainer Wegenkittl
چکیده

Cell-based first-hit ray casting is a new technique for fast perspective volume visualization. This technique, based on the well known ray casting algorithm, performs iso-surfacing and supports interactive threshold adjustment. It is accelerated by the reduction of average ray path lengths to only a few steps per pixel. The volume is divided into cubic sub volumes. Each sub volume that is intersected by an iso-surface is projected to the image plane. A local ray casting step within the sub volume is performed for each pixel covered by the projection. Cell-based first-hit ray casting is perfectly suited whenever fast perspective iso-surfacing is required. This paper describes the basic algorithm, presents possible optimizations and evaluates the performance of the algorithm for one specific application, the post-implantation assessment of endovascular stent placement. It will be shown that the algorithm, though executed on a single processor machine without any hardware acceleration, performs well for view points inside as well as outside the stented blood vessel and significantly outperforms an optimized, yet more conventional ray casting technique.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Display of Background Objects for Virtual Endoscopy using Flexible First-Hit Ray Casting

Many applications of virtual endoscopy require the display of background objects behind the semi-transparent surface of the investigated organ. This paper describes a new first-hit ray casting technique for efficient perspective iso-surfacing of arbitrarily selected objects of interest. Visualization is performed without the use of dedicated hardware or data structures limiting flexibility (e.g...

متن کامل

Ray Casting against General Convex Objects with Application to Continuous Collision Detection

This paper presents a new algorithm for computing the hit point and normal of a ray and a general convex object. The algorithm is loosely based on the the Gilbert-Johnson-Keerthi algorithm for computing the distance between convex objects in the sense that it is applicable to the same family of convex objects and uses the same subalgorithm for computing the closest point of a simplex. Since thi...

متن کامل

Interactive visualisation of a virtual colonoscopy by combining ray casting with an acceleration corridor

We present a novel acceleration technique for the volume ray casting process used in virtual colonoscopy. Our method exploits the information obtained from casting a ray to avoid redundant computations for neighbouring rays. A corridor from the image plane into the volume data set is examined whenever a ray is cast. All rays passing through this corridor reach the same cell as the first non-spa...

متن کامل

Improving Cache Locality for Ray Casting with CUDA

In this paper, we present an acceleration method for texture-based ray casting on the compute unified device architecture (CUDA) compatible graphics processing unit (GPU). Since ray casting is a memory-intensive application, our method increases the hit rate of the texture cache during rendering. To achieve this, our method dynamically selects the width and height of thread blocks (TBs) such th...

متن کامل

Streaming Model Based Volume Ray Casting Implementation for Cell Broadband Engine

Interactive high quality volume rendering is becoming increasingly more important as the amount of more complex volumetric data steadily grows. While a number of volumetric rendering techniques have been widely used, ray casting has been recognized as an effective approach for generating high quality visualization. However, for most users, the use of ray casting has been limited to datasets tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002